GATE CSE 2011
Q1.
HTML (Hyper Text Markup Language) has language elements which permit certain actions other than describing the structure of the web document. Which one of the following actions is NOT supported by pure HTML (without any server or client side scripting) pages?Q2.
Consider different activities related to email. m1: Send an email from a mail client to a mail server m2: Download an email from mailbox server to a mail client m3: Checking email in a web browser Which is the application level protocol used in each activity?Q3.
Consider a hypothetical processor with an instruction of type LW R1, 20(R2), which during execution reads a 32-bit word from memory and stores it in a 32-bit register R1. The effective address of the memory location is obtained by the addition of constant 20 and the contents of register R2. Which of the following best reflects the Addressing Modes implemented by this instruction for the operand in memory?Q4.
What does the following fragment of C-program print? char c []="GATE2011"; char *p =c; printf ("%s", p + p[3]- p[ 1 ]);Q5.
We are given a set of n distinct elements and an unlabeled binary tree with n nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree?Q6.
Which of the given options provides the increasing order of asymptotic complexityoffunctions f1, f2, f3 and f4? f_{1}(n)=2^{n}; f_{2}(n)=n^{3/2}; f_{3}(n)=nlog_{2}n; f_{4}(n)=n^{log_{2}n}Q7.
An 8KB direct mapped write-back cache is organized as multiple blocks, each of size 32-bytes. The processor generates 32-bit addresses. The cache controller maintains the tag information for each cache block comprising of the following. 1 Valid bit 1 Modified bit As many bits as the minimum needed to identify the memory block mapped in the cache. What is the total size of memory needed at the cache controller to store metadata (tags) for the cache?Q8.
Given i=\sqrt{-1}, what will be the evaluation of the definite integral \int_{0}^{\pi /2}\frac{cosx + i sinx}{cosx -i sinx} dx?Q9.
Consider the languages L1, L2 and L3 as given below L1=\{0^{p}1^{q}|p,q\in N\} L2=\{0^{p}1^{q}|p,q\in N and p=q\} and L3=\{0^{p}1^{q}0^{r}|p,q,r\in N \; and \; p=q=r\} Which of the following statements is NOT TRUE?Q10.
Consider the following table of arrival time and burst time for three processes P0, P1 and P2. The pre-emptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of processes. What is the average waiting time for the three processes?